Comparison of Interval Constraint Propagation Algorithms for Vehicle Localization
نویسندگان
چکیده
Interval constraint propagation (ICP) algorithms allow to solve problems described as constraint satisfaction problems (CSP). ICP has been successfully applied to vehicle localization in the last few years. Once the localization problem has been stated, a large class of ICP solvers can be used. This paper compares a few ICP algorithms, using the same experimental data, in order to rank their performances in terms of accuracy and computing time.
منابع مشابه
A set approach to the simultaneous localization and map building - application to underwater robots
This paper proposes a set approach for the simultaneous localization and mapping (SLAM) in a submarine context. It shows that this problem can be cast into a constraint satisfaction problem which can be solve efficiently using interval analysis and propagation algorithms. The efficiency of the resulting propagation method is illustrated on the localization of submarine robot, named Redermor. Th...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملOptimal Trajectory Study of a Small Size Waverider and Wing-Body Reentry Vehicle at Suborbital Entry Speed of Approximately 4 km/s with Dynamic Pressure and Heat Rate Constraint
A numerical trajectory optimization study of two types of lifting-entry reentry vehicle has been presented at low suborbital speed of 4.113 km/s and -15 degree entry angle. These orbital speeds are typical of medium range ballistic missile with ballistic range of approximately 2000 km at optimum burnout angle of approximately 41 degree for maximum ballistic range. A lifting reentry greatly enha...
متن کاملGuaranteed interval analysis localization for mobile robots
This paper presents a set membership method (named Interval Analysis Localization) to deal with the global localization problem of mobile robots. By using a LIDAR (LIght Detection And Ranging) range sensor, the odometry and a discrete map of an indoor environment, a robot has to determine its pose (position and orientation) in the map without any knowledge of its initial pose. In a bounded erro...
متن کاملComputing reachable sets for uncertain nonlinear hybrid systems using interval constraint propagation techniques
We investigate solution techniques for numerical constraint satisfaction problems and validated numerical set integration methods for computing reachable sets of nonlinear hybrid dynamical systems in presence of uncertainty. To use interval simulation tools with higher dimensional hybrid systems, while assuming large domains for either initial continuous state or model parameter vectors, we nee...
متن کامل